Excluding Subdivisions of Bounded Degree Graphs
نویسنده
چکیده
Let H be a fixed graph. What can be said about graphs G that have no subgraph isomorphic to a subdivision of H? Grohe and Marx proved that such graphs G satisfy a certain structure theorem that is not satisfied by graphs that contain a subdivision of a (larger) graph H1. Dvořák found a clever strengthening—his structure is not satisfied by graphs that contain a subdivision of a graph H2, where H2 has “similar embedding properties” as H. Building upon Dvořák’s theorem, we prove that said graphs G satisfy a similar structure theorem. Our structure is not satisfied by graphs that contain a subdivision of a graph H3 that has similar embedding properties as H and has the same maximum degree as H. This will be important in a forthcoming application to well-quasi-ordering.
منابع مشابه
Nonrepetitive Colourings of Graphs Excluding a Fixed Immersion or Topological Minor
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if H is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single face, then graphs excluding H as a topological minor have bounded nonrepetitive chromatic number. This is the largest class of graphs known to have bounded non...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملStars and Bonds in Crossing-Critical Graphs
The structure of previous known infinite families of crossing–critical graphs had led to the conjecture that crossing–critical graphs have bounded bandwidth. If true, this would imply that crossing–critical graphs have bounded degree, that is, that they cannot contain subdivisions of K1,n for arbitrarily large n. In this paper we prove two new results that revolve around this question. On the p...
متن کاملThe size Ramsey number of short subdivisions of bounded degree 1 graphs ∗
5 For graphs G and F , write G → (F )` if any coloring of the edges of G with ` colors yields 6 a monochromatic copy of the graph F . Let positive integers h and d be given. Suppose S 7 is obtained from a graph S with s vertices and maximum degree d by subdividing its edges h 8 times (that is, by replacing the edges of S by paths of length h+ 1). We prove that there exits 9 a graph G with no mo...
متن کاملTotally odd subdivisions and parity subdivisions: Structures and Coloring
A totally odd H-subdivision means a subdivision of a graph H in which each edge of H corresponds to a path of odd length. Thus this concept is a generalization of a subdivision of H. In this paper, we give a structure theorem for graphs without a fixed graph H as a totally odd subdivision. Namely, every graph with no totally odd H-subdivision has a tree-decomposition such that each piece is eit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014